@InProceedings{GiraldiStraOliv:2001:ImOrDu,
author = "Giraldi, Gilson A. and Strauss, Edilberto and Oliveira,
Ant{\^o}nio A. F.",
title = "Improving the original Dual-T-Snakes model",
booktitle = "Proceedings...",
year = "2001",
editor = "Borges, Leandro D{\'{\i}}bio and Wu, Shin-Ting",
pages = "346--353",
organization = "Brazilian Symposium on Computer Graphics and Image Processing, 14.
(SIBGRAPI)",
publisher = "IEEE Computer Society",
address = "Los Alamitos",
note = "The conference was held in Florian{\'o}polis, SC, Brazil, from
October 15 to 18.",
keywords = "Snakes, T-Snakes, Dual-T-Snakes, dynamic programming.",
abstract = "The Dual-T-Snakes model plus dynamic programming (DP) techniques
is an efficient methodology for boundary extraction and
segmentation of 2D images. However, the original proposal of the
Dual-T-Snakes suffers from difficulties for parameters choise and
instabilities due to the normal force definition. Also, the
proposed method to push a snake way from a local minimum is not
efficient for noise images. In this paper we address these
limitations. Firstly, we reduce the number of parameters without
affecting the basic features of Dual-T-Snakes. Next, we propose a
new normal force definition which maintains the desired features
of a balloon-like one but is more stable and gives better
performance. Then, we propose other methods to avoid local minima
based on mesh resolution, image statistics and a new region
growing technique. We demonstrate these methods for artificial and
cell images. Finally, in the future works, we figure out how to
apply Dual-T-Snakes plus Viterbi together with non-parametric
multiscale methods.",
conference-location = "Florian{\'o}polis, SC, Brazil",
conference-year = "15-18 Oct. 2001",
doi = "10.1109/SIBGRAPI.2001.963075",
url = "http://dx.doi.org/10.1109/SIBGRAPI.2001.963075",
language = "en",
organisation = "SBC - Brazilian Computer Society",
ibi = "6qtX3pFwXQZeBBx/wpAsh",
url = "http://urlib.net/ibi/6qtX3pFwXQZeBBx/wpAsh",
targetfile = "346-353.pdf",
urlaccessdate = "2024, May 02"
}